A Combined Prediction Scheme (CPS) and a concept of Prediction Accuracy Assurance (PAA) were put forward for the runtime of local and remote tasks, on the issue of inapplicability of the singleness policy to all the heterogeneous tasks. The toolkit of GridSim was used to implement the CPS, and PAA was a quantitative evaluation standard of the prediction runtime provided by a specific strategy. The simulation experiments showed that, compared with the local task prediction strategy such as Last and Sliding Median (SM), the average relative residual error of CPS respectively reduced by 1.58% and 1.62%; and compared with the remote task prediction strategy such as Running Mean (RM) and Exponential Smoothing (ES), the average relative residual error of CPS respectively reduced by 1.02% and 2.9%. The results indicate that PAA can select the near-optimal value from the results of comprehensive prediction strategy, and CPS enhances the PAA of the runtime of local and remote tasks in the computing environments.
This paper proposed a novel sparse tracking method based on multi-feature fusion to compensate for incomplete description of single feature. Firstly, to fuse various features, multiple feature descriptors of dictionary templates and particle candidates were encoded as the form of kernel matrices. Secondly, every candidate particle was sparsely represented as a linear combination of all atoms of dictionary. Then the sparse representation model was efficiently solved using a Kernelizable Accelerated Proximal Gradient (KAPG) method. Lastly, in the framework of particle filter, the weights of particles were determined by sparse coefficient reconstruction errors to realize tracking. In the tracking step, a template update strategy which employed incremental subspace learning was introduced. The experimental results show that, compared with the related state-of-the-art methods, this algorithm improves the tracking accuracy under all kinds of factors such as occlusions, illumination changes, pose changes, background clutter and viewpoint variation.
Aiming at improving the robustness in pre-processing and extracting features sufficiently for Synthetic Aperture Radar (SAR) images, an automatic target recognition algorithm for SAR images based on Deep Belief Network (DBN) was proposed. Firstly, a non-local means image despeckling algorithm was proposed based on Dual-Tree Complex Wavelet Transformation (DT-CWT); then combined with the estimation of the object azimuth, a robust process on original data was achieved; finally a multi-layer DBN was applied to extract the deeply abstract visual information as features to complete target recognition. The experiments were conducted on three Moving and Stationary Target Acquisition and Recognition (MSTAR) databases. The results show that the algorithm performs efficiently with high accuracy and robustness.